package org.example.aaaatest.A01;

import java.util.ArrayList;
import java.util.List;

/**
 * @description:
 * @author: wangbaogui
 * @create: 2025/4/1 15:16
 **/
/*
给你一个 m 行 n 列的矩阵 matrix ，请按照 顺时针螺旋顺序 ，返回矩阵中的所有元素。



示例 1：


输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,3,6,9,8,7,4,5]
示例 2：


输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出：[1,2,3,4,8,12,11,10,9,5,6,7]
 */
public class A31 {
    public static void main(String[] args) {
        int [][] matrix = {{1,2,3,4},{5,6,7,8},{9,10,11,12}};
        List<Integer> integers = spiralOrder(matrix);
        System.out.println("integers = " + integers);
    }

    public static List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> list = null;
        int[] matrix2 = matrix[0];
        for (int i = 0; i < matrix2.length; i++) {
            list.add(matrix2[i]);
        }
        for (int i = 1; i < matrix.length; i++) {
            int matrix1 = matrix[i][matrix[i].length - 1];
            list.add(matrix1);
        }

        return list;
    }

    public List<Integer> spiralOrder1(int[][] matrix) {

        List<Integer> order = new ArrayList<Integer>();
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return order;
        }
        int rows = matrix.length, columns = matrix[0].length;
        int left = 0, right = columns - 1, top = 0, bottom = rows - 1;
        while (left <= right && top <= bottom) {
            for (int column = left; column <= right; column++) {
                order.add(matrix[top][column]);
            }
            for (int row = top + 1; row <= bottom; row++) {
                order.add(matrix[row][right]);
            }
            if (left < right && top < bottom) {
                for (int column = right - 1; column > left; column--) {
                    order.add(matrix[bottom][column]);
                }
                for (int row = bottom; row > top; row--) {
                    order.add(matrix[row][left]);
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return order;
    }



}
